An Optimal Strategy for Online Non-uniform Length Order Scheduling
نویسندگان
چکیده
This paper will study an online non-uniform length order scheduling problem. For the case where online strategies have the knowledge ofΔ beforehand, which is the ratio between the longest and shortest length of order, Ting [3] proved an upper bound of ( 6Δ logΔ +O(Δ )) and Zheng et al. [2] proved a matching lower bound. This work will consider the scenario where online strategies do not have the knowledge of Δ at the beginning. Our main work is a ( 6Δ logΔ +O(Δ ))-competitive optimal strategy, extending the result of Ting [3] to a more general scenery.
منابع مشابه
An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملHow much can lookahead help in online single machine scheduling
This paper studies online single machine scheduling where jobs have unit length and the objective is to maximize the number of completed jobs. Lookahead is considered to improve the competitiveness of online deterministic strategies. For preemption-restart model, we will prove a lower bound of ( LD + 2)/( LD + 1) for the case where LD 1 and 3/2 for the case where 0 LD < 1, in which LD is the le...
متن کاملAn experimental analysis of local minima to improve neighbourhood search
The paper reports a number of experiments with local search algorithms applied to job shop scheduling. The main aim was to get insights into the structure of the underlying conguration space. We consider the disjunctive graph representation where the objective function of job shop scheduling is equal to the length of longest paths. In particular, we analyse the number of longest paths, and our ...
متن کاملScheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملOptimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008